Some easily decoded, efficient, burst error correcting block codes

Phased burst error-correcting array codes

= p2 < h, by the assumption j 2 (3 / 2) m-(3 / 2). If t > t o we simply add points with errorvalue zero to the previously stated construction. This concludes 0 We have used the Hermitian curve because the rational points on this are so easy to handle, but this is probably also the case for many other curves. For a code C * (j) from a Hermitian curve, we have however more information in the deco...

Burst Error Correcting Codes and Lattice Paths

Moderate-density Burst Error Correcting Linear Codes

It is well known that during the process of transmission errors occur predominantly in the form of a burst. However, it does not generally happen that all the digits inside any burst length get corrupted. Also when burst length is large then the actual number of errors inside the burst length is also not very less. Keeping this in view, we study codes which detect/correct moderate-density burst...

Blockwise Solid Burst Error Correcting Codes

This paper presents a lower and upper bound for linear codes which are capable of correcting errors in the form of solid burst of different lengths within different sub blocks. An illustration of such kind of codes has also been provided.

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...